i v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ

Similar documents
Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS

Mesh and Node Equations: Circuits Containing Dependent Sources

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

Method of analysis. Bởi: Sy Hien Dinh

LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT

Chapter 3 Methods of Analysis: 2) Mesh Analysis

Harmonic Coordinates for Character Articulation PIXAR

ELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of Analysis

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Hermite Splines in Lie Groups as Products of Geodesics

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

The mesh-current method

5 The Primal-Dual Method

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

Lecture 4: Principal components

Support Vector Machines

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

Parallelism for Nested Loops with Non-uniform and Flow Dependences

S1 Note. Basis functions.

Problem Set 3 Solutions

1.4 Circuit Theorems

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

Machine Learning 9. week

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis


Preconditioning Parallel Sparse Iterative Solvers for Circuit Simulation

A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES

Array transposition in CUDA shared memory

Complex Filtering and Integration via Sampling

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Analysis of Continuous Beams in General

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Scan Conversion & Shading

TN348: Openlab Module - Colocalization

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Electrical analysis of light-weight, triangular weave reflector antennas

Scan Conversion & Shading

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

Solving two-person zero-sum game by Matlab

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Reading. 14. Subdivision curves. Recommended:

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

y and the total sum of

Metric Characteristics. Matrix Representations of Graphs.

Smoothing Spline ANOVA for variable screening

Measuring Integration in the Network Structure: Some Suggestions on the Connectivity Index

1 Introducton Gven a graph G = (V; E), a non-negatve cost on each edge n E, and a set of vertces Z V, the mnmum Stener problem s to nd a mnmum cost su

An Application of Network Simplex Method for Minimum Cost Flow Problems

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

On the diameter of random planar graphs

PHYS 219 Spring semester Lecture 20: Reflection of Electromagnetic Radiation: Mirrors and Images Formed by Mirrors

the nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

A Frequency-domain Technique for Statistical Timing Analysis of Clock Meshes

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression

Intra-Parametric Analysis of a Fuzzy MOLP

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Multicriteria Decision Making

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 5 Luca Trevisan September 7, 2017

Physics 132 4/24/17. April 24, 2017 Physics 132 Prof. E. F. Redish. Outline

Control strategies for network efficiency and resilience with route choice

AP PHYSICS B 2008 SCORING GUIDELINES

Self-Calibration from Image Triplets. 1 Robotics Research Group, Department of Engineering Science, Oxford University, England

Lecture 3. ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, 2008 Pearson Education, Inc.

UNIT 2 : INEQUALITIES AND CONVEX SETS

CHAPTER 2 DECOMPOSITION OF GRAPHS

Structure from Motion

UC Berkeley Working Papers

Radial Basis Functions

Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements *

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Prof. Feng Liu. Spring /24/2017

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Lecture 5: Multilayer Perceptrons

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

Sketching of Mirror-symmetric Shapes

Pose, Posture, Formation and Contortion in Kinematic Systems

ACCURATE REGISTRATON OF MMS POINT CLOUDS OF URBAN AREAS USING TRAJECTORY

Monte Carlo Integration

Load Balancing for Hex-Cell Interconnection Network

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method

MATHEMATICS FORM ONE SCHEME OF WORK 2004

Quick error verification of portable coordinate measuring arm

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

Transcription:

5V 6 v 6 î v v Ω î Ω v v 8Ω V î v 5 6Ω 5 Mesh : 6ˆ ˆ = Mesh : ˆ 8ˆ = Mesh : ˆ ˆ ˆ 8 0 = 5 Solvng ˆ ˆ ˆ from () = Solvng ˆ ˆ ˆ from () = 7 7 Substtutng () and (5) nto () (5) and (6) 9 ˆ = A 8 ˆ = A 0 () and (6) ˆ = A 0 () () () () (5) (6) (7) (8)

5V 6 v 6 î v v Ω î Ω v v 8Ω V î v 5 6Ω 5 = ˆ ˆ = ˆ = ˆ ˆ = ˆ ˆ ˆ 5 = = ˆ 6,,,,,, ( ˆ ˆ) v = v = ˆ v = v = 8 ( ˆ ˆ ) v = 6ˆ 5 6 5 v = Loop equaton around mesh : v v v = 0 ( ˆ ˆ) ˆ = 0 6ˆ ˆ = () Loop equaton around mesh : v v v = 0 ( ) 6ˆ 8( ˆ ˆ ) = 0 5 ˆ 8ˆ = Loop equaton around mesh : v v v = 0 5 ( ˆ ˆ) 8( ˆ ˆ ) = 0 6 ˆ 8ˆ 0ˆ = 5 () ()

6 5 We can redraw ths dgraph so that there are no ntersectng branches. 5 6 Hence the above dgraph s planar.

Wrtng NodeAdmttance Matrx Y n By Inspecton Node Votage Equaton: Y Y Y, n e s Y Y Y, n e s = (8) Y n, Yn, Yn, n en s n Y e n s where = ( a lgebrac sum of all current sources leavng node j ) s j Dagonal Elements of Yn Y = sum of admttances Y j of all resstors R j connected to node m, m =,,, n, where n s the total number of nodes. s called the nodeadmttance matrx. s the nodetodatum voltage vector. s called the node current source vector. mm OffDagonal Elements of Yn Y Y n e s jk = ( sum of admttances Y j of all resstors R j connected across node j and node k ) Symmetry Property: Y s a symmetrc matrx,.e., n jk kj Y = Y

Proof : Snce Y b n () s a dagonal matrx, Y b = Y T b Y T n = ( AY A T ) T b T b = AY A = AY A b T T = Y n

Wrtng MeshImpedance Matrx Z m By Inspecton Let m be the total number of meshes of a planar dgraph G, ncludng the exteror mesh formed by traversng the outer boundary branches (.e., those branches havng only onecrculatng current ˆ passng through them). Hence, MeshCurrent Equaton : Z Z Z ˆ v, m s Z ˆ Z Z, m v s = Z ˆ m, Zm, Zm, m v m sm Z m î vs where v = ( clockwse algebrac sum of all voltage sour ces around mesh j) s j Dagonal Elements of Zm Z Z m s called the meshmpedance matrx. ˆ s called the meshcurrent vector. v s m = number of nteror meshes (wndows) = sum of mpedances Z R of all resstors located along mesh " k", k=,,, m, where m s the total number of (nteror and exteror) meshes. kk j j s called the meshvoltage source vector. OffDagonal Elements of Zm j () () Z ( = sum of mpedances Z R of all resstors along both mesh j and mesh k ) jk j j Symmetry Property: Z s a symmetrc matrx,.e., m jk kj Z = Z () ()

Extended Mesh Current Method Crcut N v _ e e _ v = ˆ A Ω v î v v Ω î KVL around mesh : ( ) v 6V ( ) v = ˆ ˆ Step. When the crcut contans " β" current sources s, s,,, use s β ther assocated voltages vs, v s,, v when applyng KVL. s β ˆ ˆ = 0 () KVL around mesh : ( ˆ ) ˆ ˆ = 6 () Step. For each current source s, add an equaton. j s j s = j s j ˆ = () Step. Solve the ( m) β equatons for ˆ, ˆ, ˆ m, vs, v,. s v sβ Substtutng () nto (), we obtan : ( ) ˆ ˆ = 6 ˆ = 0 () Substtutng () and () nto (), we obtan : 0 v = 0 v = 6V (5) ( )

Note: The unknown varables n the extended mesh current method consst of the usual m mesh currents, plus the unknown voltages assocated wth the current sources. Hence, f there are β current sources, the extended mesh current method would consst of (m)β ndependent lnear equatons nvolvng (m)β unknown varables { ˆ } ˆ ˆ m vs vs vs,,,,,,. β (m) mesh current varables β voltage varables

All branch voltages and currents can be trvally calculated from and v. î = î = 0 A, v = = 0V = ˆ ˆ = A, v = = 6V = î = 0 A, = î = A, v v = 6 V = 6 V Verfcaton of Soluton by Tellegen's Theorem : j= v= ( v) ( v) ( v) ( v) j j = (0)(0) (6)() (6)(0) ( 6)()? 0 =

Extended Node Voltage Method Crcut N v _ e e e _ = A Ω v v v Ω _ Step. When the crcut contans " α" voltages vs, v s,, v s α, use ther assocated currents s, s,, s α when applyng KCL. e ( e e) KCL at : = () ( e e) KCL at : = 0 () Step. For each voltage source v, add an equaton e e = v. _ 6V = e s j j j s e = 6 () Step. Solve the ( n) α equatons for e, e, en, s,,. s s α Substtutng () nto (), we obtan : e ( e 6) = e = 6V () Substtutng () nto (), we obtan : = 0 (5) e j

Note: The unknown varables n the extended node voltage method consst of the usual n nodetodatum voltages, plus the unknown currents assocated wth the voltage sources. Hence, f there are α voltage sources, the modfed node voltage method would consst of (n)α ndependent lnear equatons nvolvng (n)α unknown varables { e } e en s s s,,,,,,. α (n) nodetodatum voltage varables α current varables

Suffcent Condton for G to be Planar If G has less than 9 branches, t s planar. Proof. The basc nonplanar graphs have 9 and 0 branches, respectvely.

Mappng a planar dgraph on a sphere A dgraph G s planar f, and only f, t can be drawn on the surface of a sphere such that G can be parttoned nto contguous regons and colored (as n a map of countres) such that no two regons have overlappng colors.

Mappng a planar dgraph on a sphere 6 m m m 5 exteror mesh m m, m, and m are nteror clockwse meshes. We can always redraw a planar dgraph on the surface of a sphere wthout nteror branches and vceversa, as llustrated below. Although mesh m (formed by tracng along branches {,, 6} n the above planar dgraph n a clockwse drecton) appears to be counterclockwse on the sphere, t actually moves n a clockwse drecton when vewed from behnd. Although the counterclockwse loop m formed by exteror branches (.e, boundary branches wth only crculatng current) {6, 5, } does not look lke a mesh on the planar dgraph, t s n fact a clockwse mesh when the dgraph s mapped on the surface of a sphere.

6 m 5 m m Just as all countres on a globe can be mapped onto a flat plane of paper, any planar dgraph drawn on a sphere can always be redrawn as a planar dgraph on a plane.

Mappng a planar dgraph on a sphere 6 m m m 5 exteror mesh m 6 m 5 m m

Dualty Prncple There are many physcal varables, concepts, propertes, and theorems n electrcal crcut theory whch appear n pars, henceforth called dual pars, such that for each crcut theorem, property, concept, etc., there s a dual theorem, dual property, and dual concept, respectvely. Ths dualty prncple s extremely useful snce we only need to learn and memorze half of them! Varable, concept, property KVL KCL Voltage Current Seres Parallel Resstance (Ohms) Impedance Admttance Node (nondatum) Node voltage Datum node Dual varable, concept, property KCL KVL Current Voltage Parallel Seres Conductance (Semens) Admttance Impedance Mesh (nteror) Mesh current Exteror mesh

Example of Dualty e v s î R R v v s G G seres crcut parallel crcut KVL : ( R R) = vs voltage dvder: ˆ G G e KCL : ( ) = s current dvder: v R = R R v s G = G G s

Dualty Theorem For planar crcuts, the nodevoltage method and the meshcurrent method, as well as ther extended versons, are dual sets of equatons whch can be derved from each other va ther dual varables. Nodevoltage Equaton Meshcurrent equaton Ye= Z ˆ n s m = v s NodeAdmttance matrx Yn MeshImpedance matrx Zm